Learning recursive theories with the separate-and-parallel- conquer strategy
نویسندگان
چکیده
Inductive learning of recursive logical theories from a set of examples is a complex task characterized by three important issues that do not arise in single predicate learning, namely the adoption of a generality order stronger than θsubsumption, the non-monotonicity of the consistency property, and the automated discovery of dependencies between target predicates. Some variations of the classical separate-and-conquer strategy to overcome these issues have been implemented in the learning system ATRE and are reported in this paper. An application to the document image understanding domain is discussed and conclusions are drawn.
منابع مشابه
On the Effect of Caching in Recursive Theory Learning
This paper focuses on inductive learning of recursive logical theories from a set of examples. This is a complex task where the learning of one predicate definition should be interleaved with the learning of the other ones in order to discover predicate dependencies. To overcome this problem we propose a variant of the separate-and-conquer strategy based on parallel learning of different predic...
متن کاملInduction of Recursive Theories in the Normal ILP Setting: Issues and Solutions
Induction of recursive theories in the normal ILP setting is a complex task because of the non-monotonicity of the consistency property. In this paper we propose computational solutions to some relevant issues raised by the multiple predicate learning problem. A separate-and-parallel-conquer search strategy is adopted to interleave the learning of clauses supplying predicates with mutually recu...
متن کاملLearning Recursive Theories in the Normal ILP Setting
Induction of recursive theories in the normal ILP setting is a difficult learning task whose complexity is equivalent to multiple predicate learning. In this paper we propose computational solutions to some relevant issues raised by the multiple predicate learning problem. A separate-andparallel-conquer search strategy is adopted to interleave the learning of clauses supplying predicates with m...
متن کاملPARES – A Model for Parallel Recursive Programs
PowerList, ParList, and PList theories and their multidimensional extensions PowerArray, ParArray, and PArray are well suited to express recursive, data-parallel algorithms. Their abstractness is very high and assures simple and correct design of parallel programs. Base on these theories we define a model of parallel computation with a very high level of abstraction – PARES (Parallel Recursive ...
متن کاملA New Recursive Formulation for the Mixed Redundancy Strategy in Reliability Optimization Problems
One of the common approaches for improving the reliability of a specific system is to use parallel redundant components in subsystems. This approach, which is known as the redundancy allocation problem (RAP), includes the simultaneous selection of the component type and its level for each subsystem in order to maximize the system reliability.Traditionally, there are two redundancy strategies, n...
متن کامل